skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 2

Search for: All records

Creators/Authors contains: "Agarwal, Arpit"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; ; ; ; (, Communications Engineering)
  2. ; ; (, IEEE)
    Full Text Available 
  3. ; ; ; ; ; ; (, SIAM)
    Accepted Manuscript Full Text Available
  4. ; ; ; (, NeurIPS)
    Accepted Manuscript Full Text Available
  5. ; ; (, Conference on Learning Theory (COLT))
    Accepted Manuscript Full Text Available
  6. ; ; (, Advances in neural information processing systems)
    Accepted Manuscript Full Text Available
  7. ; ; (, International Conference on Machine Learning)
    Accepted Manuscript Full Text Available
  8. ; ; (, Conference on Learning Theory (COLT))
    Accepted Manuscript Full Text Available
  9. ; ; (, Proceedings of the 32nd International Conference on Algorithmic Learning Theory)
    The dueling bandits problem has received a lot of attention in recent years due to its applications in recommendation systems and information retrieval. However, due to the prevalence of malicious users in these systems, it is becoming increasingly important to design dueling bandit algorithms that are robust to corruptions introduced by these malicious users. In this paper we study dueling bandits in the presence of an adversary that can corrupt some of the feedback received by the learner. We propose an algorithm for this problem that is agnostic to the amount of corruption introduced by the adversary: its regret degrades gracefully with the amount of corruption, and in case of no corruption, it essentially matches the optimal regret bounds achievable in the purely stochastic dueling bandits setting. 
    more » « less
    Accepted Manuscript Full Text Available
  10. ; ; (, Advances in neural information processing systems)
    Accepted Manuscript Full Text Available